Cooperative Simulated Annealing : How much cooperation is enough ?
نویسندگان
چکیده
This paper provides empirical evidence in support of the hypothesis, that a populational extension of simulated annealing with cooperative transitions leads to a significant increase of efficiency and solution quality for a given combinatorial optimization problem (and a neighborhood relation) if and only if the globally optimal solution is located "close" to the center of all locally optimal solution.
منابع مشابه
COMAIDE: Information Visualization using Cooperative 3D Diagram Layout
COMAIDE is a toolkit for user-system cooperation through joint multi-focal graph browsing. It supports cooperative force-directed layout management, concurrent with dialogue handling, for heterogeneous multi-layered 3D interactive diagrams. The layout manager's intu-itively`natural' animations of multi-layered 3D graph drawings support: 1. Cooperative tidying of user-manipulable 3D layout; 2. O...
متن کاملNumeric Multi-Objective Rule Mining Using Simulated Annealing Algorithm
Abstract as a single objective one. Measures like support, confidence and other interestingness criteria which are used for evaluating a rule, can be thought of as different objectives of association rule mining problem. Support count is the number of records, which satisfies all the conditions that exist in the rule. This objective represents the accuracy of the rules extracted from the da...
متن کاملAsynchronous Cooperative Local Search for the Office-Space-Allocation Problem
We investigate cooperative local search to improve upon known results of the office-spaceallocation problem in universities and other organizations. A number of entities (e.g., research students, staff, etc.) must be allocated into a set of rooms so that the physical space is utilized as efficiently as possible while satisfying a number of hard and soft constraints. We develop an asynchronous c...
متن کاملSimulated Annealing Approach for Solving Bilevel Programming Problem
Bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. Bilevel programming has been proved to be an Np-hard problem. Numerous algorithms have been developed for solving bilevel programming problems. These algorithms lack the required efficiency for solving a real problem. ...
متن کاملCooperative Behavior in Coupled Simulated Annealing Processes with Variance Control
In this paper we describe the use of coupling to interconnect different Simulated Annealing (SA) processes. The objective is to allow cooperative behavior among the processes in order to improve performance. Coupled Simulated Annealing (CSA) permits a high degree of parallelization while delivering much better results than a typical Parallel SA (PSA) algorithm. This is possible due to the intro...
متن کامل